ReP USP - Resultado da busca

Artigo de periodico
An improved upper bound on the density of universal random graphs (2015)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Random Structures & Algorithms. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, v. 46, n. 2, p. 274-299, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20545. Acesso em: 28 abr. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2015). An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, 46( 2), 274-299. doi:10.1002/rsa.20545
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1002/rsa.20545
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1002/rsa.20545
Trabalho de evento
An improved upper bound on the density of universal random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 28 abr. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Artigo de periodico
Universality of random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. SIAM Journal on Discrete Mathematics, v. 26, n. 1, p. 353-374, 2012Tradução . . Disponível em: https://doi.org/10.1137/10079882X. Acesso em: 28 abr. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). Universality of random graphs. SIAM Journal on Discrete Mathematics, 26( 1), 353-374. doi:10.1137/10079882X
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. Universality of random graphs [Internet]. SIAM Journal on Discrete Mathematics. 2012 ; 26( 1): 353-374.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1137/10079882X
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. Universality of random graphs [Internet]. SIAM Journal on Discrete Mathematics. 2012 ; 26( 1): 353-374.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1137/10079882X
Artigo de periodico
Ramsey games against a one-armed bandit (2003)
Friedgut, Ehud; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej; Tetali, Prasad
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FRIEDGUT, Ehud et al. Ramsey games against a one-armed bandit. Combinatorics, Probability & Computing, v. 12, n. 5-6, p. 515-545, 2003Tradução . . Disponível em: https://doi.org/10.1017/S0963548303005881. Acesso em: 28 abr. 2024.
APA
Friedgut, E., Kohayakawa, Y., Rodl, V., Rucinski, A., & Tetali, P. (2003). Ramsey games against a one-armed bandit. Combinatorics, Probability & Computing, 12( 5-6), 515-545. doi:10.1017/S0963548303005881
NLM
Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey games against a one-armed bandit [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 515-545.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1017/S0963548303005881
Vancouver
Friedgut E, Kohayakawa Y, Rodl V, Rucinski A, Tetali P. Ramsey games against a one-armed bandit [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 515-545.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1017/S0963548303005881
Trabalho de evento
Near-optimum universal graphs for graphs with bounded degrees (2001)
Alon, Noga; Capalbo, Michael; Wakabayashi, Yoshiko ; Rodl, Vojtech; Rucinski, Andrzej; Szemerédi, Endre
Source: Proceedings. Conference titles: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Near-optimum universal graphs for graphs with bounded degrees. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44666-4_20. Acesso em: 28 abr. 2024.
APA
Alon, N., Capalbo, M., Wakabayashi, Y., Rodl, V., Rucinski, A., & Szemerédi, E. (2001). Near-optimum universal graphs for graphs with bounded degrees. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44666-4_20
NLM
Alon N, Capalbo M, Wakabayashi Y, Rodl V, Rucinski A, Szemerédi E. Near-optimum universal graphs for graphs with bounded degrees [Internet]. Proceedings. 2001 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/3-540-44666-4_20
Vancouver
Alon N, Capalbo M, Wakabayashi Y, Rodl V, Rucinski A, Szemerédi E. Near-optimum universal graphs for graphs with bounded degrees [Internet]. Proceedings. 2001 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/3-540-44666-4_20

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation